A Novel Branch-and-Bound Algorithm for the Chance-Constrained RCPSP
نویسندگان
چکیده
منابع مشابه
Chance-Constrained Model for RCPSP with Uncertain Durations
Project scheduling with uncertain durations becomes a research focus with the development of uncertainty theory. Most researches concerned aim at minimizing project makespan or project cost according to different decision criterions. However, few works considered resource constraint, which initially appeared in deterministic resource-constrained project scheduling problem (RCPSP) and reflects t...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
We present a new approach for exactly solving chance-constrained mathematical programs having discrete distributions with finite support and random polyhedral constraints. Such problems have been notoriously difficult to solve due to nonconvexity of the feasible region, and most available methods are only able to find provably good solutions in certain very special cases. Our approach uses both...
متن کاملElectronic Companion to: A Branch-and-Cut Decomposition Algorithm for Solving Chance-Constrained Mathematical Programs
This document is a companion to the article [1], which provides more details of how the instances used for computational experiments in [1] were generated. The author will provide the actual data upon request. A base instance with n resources and m customer types is generated as follows. First, the resource unit costs c ∈ Rn were generated as independent realizations of a N(1, 0.2) random varia...
متن کاملBranch and Price for Chance Constrained Bin Packing
This article considers two versions of the stochastic bin packing problem with chance constraints. In the first version, we formulate the problem as a two-stage stochastic integer program that considers item-tobin allocation decisions in the context of chance constraints on total item size within the bins. Next, we describe a distributionally robust formulation of the problem that assumes the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2016
ISSN: 1556-5068
DOI: 10.2139/ssrn.2841157